Optimal ensemble size for parallel implementations of simulated annealing

Simulated Annealing : Comparison of Vector and Parallel Implementations

2 Contents page 1 Introduction 3 1.1 Aim of the research 3 1.2 Background 3 2 Functional Aspects of the S.A. procedure 5 2.1 The sequential version 5 2.2 The vector version 6 2.3 The parallel version 6 3 Implementation Aspects 8 3.1 The vector version 8 3.1.1 Short description of vector processing 8 3.1.2 Description of the implementation 9 3.2 The parallel version 12 4 Time complexities 14 4.1...

Neighborhood Parallel Simulated Annealing

Parallel Simulated Annealing Algorithms

n different nodes of the network. The two algorithms have been applied to the job shop scheduling problem (JSS) and the traveling salesman problem (TSP). Both algorithms showed very good performance in terms of solution time and solution quality. The rest of the paper is organized in the following fashion. Section II describes the simulated annealing technique. Section III presents the cluster ...

Ensemble Selection using Simulated Annealing Walking

Pruning an ensemble of classifiers is one of the most significant and effective issues in ensemble method topic. This paper presents a new ensemble pruning method inspired by upward stochastic walking idea. Our proposed method incorporates simulated annealing algorithm and forward selection method for selecting models through the ensemble according to the probabilistic steps. Experimental compa...

Parallel Simulated Annealing for Stochastic Reservoir Modeling

Simulatedannealing (SA) Wutiques have shown great potential to generate geologically realistic permeability fields by combining data from many sources, such as well logs, cores, and tracer tests. However, the application of SA in reservoir description and simulation is limited owing to its prohibitively large computational time requirement, even on modern MqXWornputem. This paper introduces an ...